Durational Actions Timed Automata: Determinization and Expressiveness

In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA* is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is determinizable and closed under all Boolean operations. As result, the language inclusion problem is decidable. Then, we compare a durational actions timed automata to event recording automata, which is a determinizable sub class of the classical timed automata. Next, we propose a simple framework to aggregate region of DATA* for reducing its space state. This study is based on an aggregation region automata procedure to reduce the combinatorial explosion of regions. Finally, we discuss equivalence and validation of systems. General Terms Real time systems, Formal models, Characterization of models.